PERFECT STATE TRANSFER, GRAPH PRODUCTS AND EQUITABLE PARTITIONS
نویسندگان
چکیده
منابع مشابه
Perfect State Transfer, Graph Products and Equitable Partitions
We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on generalizations of the double cones and variants of the Cartesian graph products (which include the hypercube). We also describe a generalization of the path collapsing argument (which reduces questions about perfect state transfer to simpler weighted mul...
متن کاملLocally constrained graph homomorphisms and equitable partitions
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent characterizations of degree matrices. As a consequence we can efficiently check whether a given matrix M is a degree matrix of some graph and also compute the size of a smallest graph for which it is a degree matrix in polyno...
متن کاملEquitable Partitions and Orbit Partitions
We consider two kinds of partition of a graph, namely orbit partitions and equitable partitions. Although an orbit partition is always an equitable partition, the converse is not true in general. We look at some classes of graphs for which the converse is true.
متن کاملα-Kuramoto partitions: graph partitions from the frustrated Kuramoto model generalise equitable partitions
The Kuramoto model describes the collective dynamics of a system of coupled oscillators. An α-Kuramoto partition is a graph partition induced by the Kuramoto model, when the oscillators include a phase frustration parameter. We prove that every equitable partition is an α-Kuramoto partition, but that the converse does necessarily not hold. We give an exact characterisation of α-Kuramoto biparti...
متن کاملHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by χ=(G). It is interesting to note that if a graph G is equitably k-colorable, it does not imply that it is equitab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Quantum Information
سال: 2011
ISSN: 0219-7499,1793-6918
DOI: 10.1142/s0219749911007472